The probabilistic zeta function of finite simple groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic generation of finite simple groups, II

In earlier work it was shown that each nonabelian finite simple group G has a conjugacy class C such that, whenever 1 = x ∈G, the probability is greater than 1/10 that G= 〈x, y〉 for a random y ∈ C. Much stronger asymptotic results were also proved. Here we show that, allowing equality, the bound 1/10 can be replaced by 13/42; and, excluding an explicitly listed set of simple groups, the bound 2...

متن کامل

The Probabilistic Zeta Function

This paper is a summary of results on the PG(s) function, which is the reciprocal of the probabilistic zeta function for finite groups. This function gives the probability that s randomly chosen elements generate a group G, and information about the structure of the group G is embedded in it.

متن کامل

On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function

We prove that the number of conjugacy classes of maximal subgroups of bounded order in a finite group of Lie type of bounded rank is bounded. For exceptional groups this solves a longstanding open problem. The proof uses, among other tools, some methods from Geometric Invariant Theory. Using this result we provide a sharp bound for the total number of conjugacy classes of maximal subgroups of L...

متن کامل

Probabilistic and asymptotic aspects of finite simple groups

This is a survey of recent developments in the probabilistic and asymptotic theory of finite groups, with a particular emphasis on the finite simple groups. The first two sections are concerned with random generation, while the third section focusses on some applications of probabilistic methods in representation theory. The final section deals with some of the asymptotic aspects of the diamete...

متن کامل

GAP Computations Concerning Probabilistic Generation of Finite Simple Groups

This is a collection of examples showing how the GAP system [GAP12] can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in [BGK08]. The purpose of this writeup is twofold. On the one hand, the computations are documented this way. On the other hand, the GAP code shown for th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2007

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2007.02.055